Argumentation-based schema matching for multiple digital libraries

Purpose – Most digital libraries (DLs) are now available online. They also provide the Z39.50 standard protocol which allows computer-based systems to effectively retrieve information stored in the DLs. The major difficulty lies in inconsistency between database schemas of multiple DLs. This paper presents a system known as Argumentation-based Digital Library Search (or ADLSearch) which facilitates information retrieval across multiple DLs. Design/methodology/approach – The proposed approach is based on argumentation theory for schema matching reconciliation from multiple schema matching algorithms. In addition a distributed architecture is proposed for the ADLSearch system for information retrieval from multiple DLs. Findings – Initial performance results are promising. First, schema matching can improve retrieval performance in DLs, as compared with the baseline technique. Subsequently, argumentation-based retrieval can yield better matching accuracy and retrieval efficiency than individual schema matching algorithms. Research limitations/implications – The work discussed in this paper has been implemented as a prototype supporting scholarly retrieval from about 800 DLs around the world. However, due to the complexity of the argumentation algorithms, the process of adding new DLs to the system cannot be performed in a real-time manner. Originality/value – In this paper an argumentation-based approach is proposed for reconciling the conflicts from multiple schema matching algorithms in the context of information retrieval from multiple digital libraries. Moreover, the proposed approach can D ow nl oa de d by U ni ve rs ity o f R ea di ng A t 1 2: 11 2 7 D ec em be r 20 14 ( PT ) also be applied to similar applications which require automatic mapping from multiple database schemas.